Stabilizing kinetic feedback design using semidefinite programming
نویسندگان
چکیده
منابع مشابه
Dynamic Bounds on Stochastic Chemical Kinetic Systems Using Semidefinite Programming
The method of moments has been proposed as a potential means to reduce the dimensionality of the chemical master equation (CME) appearing in stochastic chemical kinetics. However, attempts to apply the method of moments to the CME usually result in the so-called closure problem. Several authors have proposed moment closure schemes, which allow them to obtain approximations of quantities of inte...
متن کاملStructural Design via Semidefinite Programming
We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural...
متن کاملDesign of GBSB neural associative memories using semidefinite programming
This paper concerns reliable search for the optimally performing GBSB (generalized brain-state-in-a-box) neural associative memory given a set of prototype patterns to be stored as stable equilibrium points. First, we observe some new qualitative properties of the GBSB model. Next, we formulate the synthesis of GBSB neural associative memories as a constrained optimization problem. Finally, we ...
متن کاملOptimal Design of Frequency-Response-Masking Filters Using Semidefinite Programming
Since Lim’s 1986 paper on the frequency-responsemasking (FRM) technique for the design of finite-impulse response digital filters with very small transition widths, the analysis and design of FRM filters has been a subject of study. In this paper, a new optimization technique for the design of various FRM filters is proposed. Central to the new design method is a sequence of linear updates for ...
متن کاملEnsemble Clustering using Semidefinite Programming
We consider the ensemble clustering problem where the task is to 'aggregate' multiple clustering solutions into a single consolidated clustering that maximizes the shared information among given clustering solutions. We obtain several new results for this problem. First, we note that the notion of agreement under such circumstances can be better captured using an agreement measure based on a 2D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.10.744